Chebyshev Approximation of Plane Curves by Splines
نویسندگان
چکیده
منابع مشابه
Approximation of curves by fairness splines with tangent conditions
We present in this paper an approximation method of curves from sets of Lagrangian data and vectorial tangent subspaces. We de1ne a discrete smoothing fairness spline with tangent conditions by minimizing certain quadratic functional on 1nite element spaces. Convergence theorem is established and some numerical and graphical examples are analyzed in order to show the validity and the e4ectivene...
متن کاملVariable degree polynomial splines are Chebyshev splines
Variable degree polynomial (VDP) splines have recently proved themselves as a valuable tool in obtaining shape preserving approximations. However, some usual properties which one would expect of a spline space in order to be useful in geometric modeling, do not follow easily from their definition. This includes total positivity (TP) and variation diminishing, but also constructive algorithms ba...
متن کاملCurves Defined by Chebyshev Polynomials
Working over a field k of characteristic zero, this paper studies line embeddings of the form φ = (Ti, Tj , Tk) : A → A, where Tn denotes the degree n Chebyshev polynomial of the first kind. In Section 4, it is shown that (1) φ is an embedding if and only if the pairwise greatest common divisor of i, j, k is 1, and (2) for a fixed pair i, j of relatively prime positive integers, the embeddings ...
متن کاملApproximation by Conic Splines
We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε +O(1), if the spline consists of parabolic arcs, and c2ε + O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the Euclidean and affine curvature of the curve. We also show that...
متن کاملApproximation of digitized curves with cubic Bézier splines
In this paper we examine a problem of digitized curves approximation for raster graphics vectorization and develop an efficient implementation of a near-optimal Dynamic Programming algorithm for digitized curves approximation with cubic Bézier splines for a given distortion bound. For better fitting performance, we introduce the inflection points with relaxed constraint of tangent continuity. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1994
ISSN: 0021-9045
DOI: 10.1006/jath.1994.1010